Factorizations of Algebraic Integers, Block Monoids, and Additive Number Theory
نویسندگان
چکیده
Let D be the ring of integers in a finite extension of the rationals. The classic examination of the factorization properties of algebraic integers usually begins with the study of norms. In this paper, we show using the ideal class group, C(D), of D that a deeper examination of such properties is possible. Using the class group, we construct an object known as a block monoid, which allows us to offer proofs of three major results from the theory of nonunique factorizations: Geroldinger’s theorem, Carlitz’s theorem and Valenza’s theorem. The combinatorial properties of block monoids offer a glimpse into two widely studied constants from additive number theory, the Davenport constant and the cross number. Moreover, block monoids allow us to extend these results to the more general classes of Dedekind domains and Krull domains.
منابع مشابه
New York Number Theory Seminar Ninth Annual Workshop on Combinatorial and Additive Number Theory Abstracts of Lectures
s of lectures Paul Baginski, Université Claude Bernard Lyon, France “Factoring within arithmetic progressions” Abstract: An arithmetic congruence monoid is an arithmetic progression Ma,b := a+ bN which is closed under multiplication. For this to be the case, the parameters must satisfy a ≡ a mod b. Though these Ma,b are multiplicative subsemigroups of N, their factorization properties differ gr...
متن کاملErdős-Zaks all divisor sets
Let Zn be the finite cyclic group of order n and S ⊆ Zn. We examine the factorization properties of the Block Monoid B(Zn, S) when S is constructed using a method inspired by a 1990 paper of Erdős and Zaks. For such a set S, we develop an algorithm in Section 2 to produce and order a set {Mi} i=1 which contains all the non-primary irreducible Blocks (or atoms) of B(Zn, S). This construction yie...
متن کاملArithmetic Congruence Monoids: A Survey
We consider multiplicative monoids of the positive integers defined by a single congruence. If a and b are positive integers such that a≤ b and a2≡ a mod b, then such a monoid (known as an arithmetic congruence monoid or an ACM) can be described as Ma,b = (a+ bN0)∪{1}. In lectures on elementary number theory, Hilbert demonstrated to students the utility of the proof of the Fundamental Theorem o...
متن کاملCombinatorial operads from monoids
We introduce a functorial construction which, from a monoid, produces a setoperad. We obtain new (symmetric or not) operads as suboperads or quotients of the operads obtained from usual monoids such as the additive and multiplicative monoids of integers and cyclic monoids. They involve various familiar combinatorial objects: endofunctions, parking functions, packed words, permutations, planar r...
متن کاملASYMPTOTIC NORMALITY OF b-ADDITIVE FUNCTIONS ON POLYNOMIAL SEQUENCES IN CANONICAL NUMBER SYSTEMS
We consider b-additive functions f where b is the base of a canonical number system in an algebraic number field. In particular, we show that the asymptotic distribution of f(p(z)) with p a polynomial running through the integers of the algebraic number field is the normal law. This is a generalization of results of Bassily and Katai (for the integer case) and of Gittenberger and Thuswaldner (f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The American Mathematical Monthly
دوره 118 شماره
صفحات -
تاریخ انتشار 2011